#include <cstdio>
#include <algorithm>
using namespace std;

int a[1005];

int main() {
	int n, l, k;
	scanf("%d %d %d", &n, &l, &k);
	for (int i = 1; i <= n; ++i) {
		scanf("%d", a + i);
	}

	sort(a + 1, a + n + 1);
	int ans = 0;

	for (int i = 1; i <= n; ++i) {
		if (l >= a[i]) {
			++ans;
			l += k;
		} else {
			break;
		}
	}

	printf("%d\n", ans);
	return 0;
}